Coloring Graphs in Oriented Coloring of Cubic Graphs

Abstract Oriented coloring of an oriented graph G is arc-preserving homomorphism from into a tournament H . We say that the universal for family graphs $$\mathcal {C}$$ C if every $$G\in \mathcal G ∈ there exists are interested in finding orientations cubic graphs. In this paper we present constructive proof that: on 7 vertices orientation graphs, then minimum out-degree and in-degree equal to 2. That gives negative answer question presented Pinlou’s PHD thesis.